-
1 выходные данные алгоритма
Makarov: algorithm outputУниверсальный русско-английский словарь > выходные данные алгоритма
-
2 результат работы алгоритма
Makarov: algorithm outputУниверсальный русско-английский словарь > результат работы алгоритма
-
3 Отсутствие артиклей перед существительными, которые снабжены ссылками
It follows from Theorem 1 that $x=1$Section 2 of this paper gives (contains) a concise presentation of the notation to be used belowProperty 1 is called (known as) the triangle inequalityThis assertion (statement, proposition) has been proved in part 1 (part (a)) of the (our) proofAlgorithm 1 (с большой буквы) defines elementary permutations and elementary triangle matrices of index 2Equation (1) ((the) inequality (1)) can thus be written in the (артикль обязателен) form (2)In the language of our notation, algorithm (1) (с маленькой буквы) is a stable way of computing the inner productThe only place where the algorithm can break down is in statement 3 (in Statement 3)We combine Exercises 1 and 2 to construct an algorithm for finding an approximate eigenvectorThis case is illustrated in (но не on) Figure 1The asymptotic formula (1) was proved in Example 1Corollary 1 can be used to estimate the error in the inverse of a perturbed matrixBy property 1 (by Theorem 1), this function is positive except at the zero vectorA less trivial example is given in Appendix 3Step 1 in Example 1 and steps 2 and 3 in Example 2The idea of a norm will be introduced in Chapter 4Now from statements 2 and 3 of (1), we have...All the drivers for solving linear systems are listed in Table 1 (are illustrated in Figure 1)If Algorithm 1 in four-digit arithmetic is applied to refine $x$, then we obtain...Assertion (ii) is nothing but the statement that one natural way of extending these ideas to $R^n$ is to generalize formula (1) to obtain a Euclidean length of a vectorBy property 1, this function is positive except at the zero vectorWe have seen on page 3 that set of matrices is a vector space which is essentially identical with...Equation (1) effectively gives an algorithm for using the output of Algorithm 1 to solve...Русско-английский словарь по прикладной математике и механике > Отсутствие артиклей перед существительными, которые снабжены ссылками
-
4 виды оплаты
forms [or types] of paymentКлассификация начислений и вычетов из заработной платы. Код вида оплаты определяет правила формирования, обработки, расчета и проверки сумм по данному виду оплаты, правила использования этого вида оплаты для последующих операций и расчетов, включения в налогооблагаемые базы и вывода в отчетные формы - алгоритм расчета. — Classification of wage charges and deductions. Payment form code determines the rules for generation, processing, calculation and examination of the amounts in respect of a given form of payment, the rules of use of this form of payment for further operations and calculations, inclusion in taxable bases and output to report forms - calculation algorithm.
виды оплаты, вторичные или технические — secondary or technical forms of payment
Технические виды оплаты, генерируемые системой вовремя и для расчета. Вторичные виды оплаты используются для суммирования нескольких видов оплаты или сохранения внутренних результатов расчета. Технические виды оплат в каталоге видов оплат системы SAP R/ (Независимость учащихся в принятии решений (СК).) начинаются с символа "/". — Technical forms of payment, which are generated by the system in due time and for calculation. Secondary forms of payment are used for summation of several forms of payment or for preservation of internal calculation results. Technical forms of payment in the catalogue of SAP R/ (Независимость учащихся в принятии решений (СК).) system forms of payment begin with "/" symbol.
-
5 механизм логического вывода
1. inference engine2. inferencing engine3. inferential mechanismмеханизм вывода; устройство вывода — output mechanism
Русско-английский большой базовый словарь > механизм логического вывода
-
6 оптимальный
1. economicэкономичный размер; оптимальный размер — economic size
2. best value3. optimalоптимальное решение; оптимальный план — optimal solution
4. optimumСинонимический ряд:лучший (прил.) лучший; наилучший; первейший; самолучший -
7 развязка
1. ж. радио, элк. decoupling2. ж. радио, элк. isolation3. ж. радио, элк. discriminationАнтонимический ряд:
См. также в других словарях:
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
Output-sensitive algorithm — In computer science, an output sensitive algorithm is an algorithm whose running time depends not only on the size of the input but also on the size of the output. For certain problems where the output size varies widely, for example from linear… … Wikipedia
algorithm — noun /ˈælɡəɹɪðm/ A precise step by step plan for a computational procedure that begins with an input value and yields an output value in a finite number of steps. Informally, an algorithm is any well defined computational procedure that takes… … Wiktionary
Algorithm examples — This article Algorithm examples supplements Algorithm and Algorithm characterizations. = An example: Algorithm specification of addition m+n =Choice of machine model:This problem has not been resolved by the mathematics community. There is no… … Wikipedia
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
Randomized algorithm — Part of a series on Probabilistic data structures Bloom filter · Skip list … Wikipedia
Shunting yard algorithm — The shunting yard algorithm is a method for parsing mathematical equations specified in infix notation. It can be used to produce output in Reverse Polish notation (RPN) or as an abstract syntax tree (AST). The algorithm was invented by Edsger… … Wikipedia
Cardiac output — (Q or or CO ) is the volume of blood being pumped by the heart, in particular by a left or right ventricle in the time interval of one minute. CO may be measured in many ways, for example dm3/min (1 dm3 equals 1000 cm3 or 1 litre). Q is… … Wikipedia
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
